Variations on Realizability: Realizing the Propositional Axiom of Choice

نویسنده

  • Martin Hyland
چکیده

Early investigators of realizability were interested in metamathematical questions. In keeping with the traditions of the time they concentrated on interpretations of one formal system in another. They considered an ad hoc collection of increasingly ingenious interpretations to establish consistency, independence and conservativity results. van Oosten’s contribution to the Workshop (see van Oosten [46]) gave inter alia an account of these concerns from a modern perspective. In the early days of categorical logic one considered realizability as providing models for constructive mathematics; while the metamathematics could be retrieved by ‘coding’ the models, that aspect took a back seat. In the first instance realizability provided toposes, that is models for constructive type theory; but it also can be used to model stronger systems of impredicative constructive set theory. In time it was recognized that the mathematical structures arising from realizability provided models for more exotic non-classical theories of interest. Work then focused in particular on models for impredicative polymorphic calculi such as System F (Girard [12]) and the Calculus of Constructions (Coquand and Huet [7]), and on Synthetic Domain Theory (Hyland [19] and Taylor [41]). The use of realizability in this context has a quite different character from its earlier metamathematical use. For details of realizability models impredicative type theories the reader may consult Crole [8]. For formal expositions of Synthetic Domain Theory informed by the realizability experience see Reus [34] and Reus and Streicher [35]. The focus of this paper is on the axiom of choice

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On characterizations of the fully rational fuzzy choice functions

In the present paper, we introduce the fuzzy Nehring axiom, fuzzy Sen axiom and weaker form of the weak fuzzycongruence axiom. We establish interrelations between these axioms and their relation with fuzzy Chernoff axiom. Weexpress full rationality of a fuzzy choice function using these axioms along with the fuzzy Chernoff axiom.

متن کامل

Realizability of the Axiom of Choice in HOL. (An Analysis of Krivine's Work)

This paper is an introduction to recent works in realizability, mainly Krivine’s work to realize the dependent choice axiom. We also show how to improve programs extracted from classical proofs by distinguishing formulas with and without algorithmic contents.

متن کامل

Realizability in classical logic

The essential aim is to explore the Curry-Howard correspondence : we want to associate a program with each mathematical proof and to consider each theorem as a specification, i.e. to find the common behavior of the programs associated with every proof of this theorem. It is a very difficult and very interesting problem, which I call the ‘‘ specification problem ’’ in what follows. In the first ...

متن کامل

Realizing Mahlo set theory in type theory

After introducing the large set notion of Mahloness, this paper shows that constructive set theory with an axiom asserting the existence of a Mahlo set has a realizability interpretation in an extension of Martin-Löf type theory developed by A. Setzer.

متن کامل

Bar recursion in classical realisability : dependent choice and well ordering of R

This paper is about the bar recursion operator [9], in the context of classical realizability [6, 7]. It is a sequel to the three papers [1, 2, 10]. We use the definitions and notations of the theory of classical realizability as expounded in [5, 6, 7].1 In [1], S. Berardi, M. Bezem and T. Coquand have shown that a form of the bar recursion operator can be used, in a proof-program correspondenc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Mathematical Structures in Computer Science

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2002